On Pmhss Iteration Methods for Continuous Sylvester Equations
نویسندگان
چکیده
The modified Hermitian and skew-Hermitian splitting (MHSS) iteration method and preconditioned MHSS (PMHSS) iteration method were introduced respectively. In the paper, on the basis of the MHSS iteration method, we present a PMHSS iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and complex symmetric positive definite/semi-definite matrices. Under suitable conditions, we prove the convergence of the PMHSS iteration method and discuss the spectral properties of the preconditioned matrix. Moreover, to reduce the computing cost, we establish an inexact variant of the PMHSS iteration method and analyze its convergence property in detail. Numerical results show that the PMHSS iteration method and its inexact variant are efficient and robust solvers for this class of continuous Sylvester equations. Mathematics subject classification: 65F10, 65F50.
منابع مشابه
A Parallel Two-Stage Iteration Method for Solving Continuous Sylvester Equations
In this paper we propose a parallel two-stage iteration algorithm for solving large-scale continuous Sylvester equations. By splitting the coefficient matrices, the original linear system is transformed into a symmetric linear system which is then solved by using the SYMMLQ algorithm. In order to improve the relative parallel efficiency, an adjusting strategy is explored during the iteration ca...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملPreconditioned MHSS iteration methods for a class of block two-by-two linear systems with applications to distributed control problems
We construct a preconditioned modified Hermitian and skew-Hermitian splitting (PMHSS) iteration scheme for solving and preconditioning a class of block two-by-two linear systems arising from the Galerkin finite element discretizations of a class of distributed control problems. The convergence theory of this class of PMHSS iteration methods is established and the spectral properties of the PMHS...
متن کاملA Generalized HSS Iteration Method for Continuous Sylvester Equations
Based on the Hermitian and skew-Hermitian splitting (HSS) iteration technique, we establish a generalized HSS (GHSS) iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semidefinite matrices. The GHSS method is essentially a four-parameter iteration which not only covers the standard HSS iteration but also enables us to optimize the ...
متن کامل